package com.squapsource.project_euler;

import java.math.BigInteger;


public class Problem25 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		BigInteger lastNumber = BigInteger.valueOf(1);
		BigInteger currentNumber = BigInteger.valueOf(1);
		int counter = 2;

		while (String.valueOf(currentNumber).length() < 1000) {
			BigInteger temp = currentNumber;
			currentNumber = currentNumber.add(lastNumber);
			lastNumber = temp;
			counter++;
		}
		System.out.println(currentNumber + " " + counter);

	}

}
